An improvement direction for filter selection techniques using information theory measures and quadratic optimization
نویسندگان
چکیده
منابع مشابه
An improvement direction for filter selection techniques using information theory measures and quadratic optimization
Filter selection techniques are known for their simplicity and efficiency. However this kind of methods doesn’t take into consideration the features inter-redundancy. Consequently the un-removed redundant features remain in the final classification model, giving lower generalization performance. In this paper we propose to use a mathematical optimization method that reduces inter-features redun...
متن کاملusing game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
A New Hybrid Framework for Filter based Feature Selection using Information Gain and Symmetric Uncertainty (TECHNICAL NOTE)
Feature selection is a pre-processing technique used for eliminating the irrelevant and redundant features which results in enhancing the performance of the classifiers. When a dataset contains more irrelevant and redundant features, it fails to increase the accuracy and also reduces the performance of the classifiers. To avoid them, this paper presents a new hybrid feature selection method usi...
متن کاملA Novel Information Theory Method for Filter Feature Selection
In this paper, we propose a novel filter for feature selection. Such filter relies on the estimation of the mutual information between features and classes. We bypass the estimation of the probability density function with the aid of the entropic-graphs approximation of Rényi entropy, and the subsequent approximation of the Shannon one. The complexity of such bypassing process does not depend o...
متن کاملBounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques
The quadratic assignment problem (denoted QAP), in the trace formulation over the permutation matrices, is min X2 tr(AXB + C)X t : Several recent lower bounds for QAP are discussed. These bounds are obtained by applying continuous optimization techniques to approximations of this combinatorial optimization problem, as well as by exploiting the special matrix structure of the problem. In particu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Research in Artificial Intelligence
سال: 2012
ISSN: 2165-4069,2165-4050
DOI: 10.14569/ijarai.2012.010502